Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
نویسندگان
چکیده
منابع مشابه
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibilities to model the Hop Constrained (HC) Connected Facility Location problem (ConFL) as ConFL on layered graphs. We show that on all three layered graphs the respective LP relaxations of two cut based models are of the ...
متن کاملHop Constrained Connected Facility Location
The Connected Facility Location (ConFL) problem combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facili...
متن کاملLayered Graph Approaches to the Hop Constrained Connected Facility Location Problem
Given a set of customers, a set of potential facility locations and some inter-connection nodes, the goal of the Connected Facility Location problem (ConFL) is to find the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The sum of costs needed for building the Steiner tree, facility opening costs and the assignment...
متن کاملHop Constrained Connected Facility Location: A Hierarchy of Formulations
Connected Facility Location (ConFL) is a problem that combines network design and facility location aspects: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Stein...
متن کاملIP modeling of the survivable hop constrained connected facility location problem
We consider a generalized version of the rooted connected facility location problem which occurs in planning of telecommunication networks with both survivability and hop-length constraints. Given a set of client nodes, a set of potential facility nodes including one predetermined root facility, a set of optional Steiner nodes, and the set of the potential connections among these nodes, that ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2010
ISSN: 1571-0653
DOI: 10.1016/j.endm.2010.05.027